/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 110;
int a[maxn];
struct node
{
    int num, id;
};
queue<node> q;
int cnt[10];
int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        while (!q.empty())
            q.pop();
        memset(cnt, 0, sizeof(cnt));
        int n, m;
        scanf("%d%d", &n, &m);
        for (int i = 0; i < n; i++)
        {
            node tp;
            scanf("%d", &tp.num);
            tp.id = i;
            q.push(tp);
            cnt[tp.num]++;
        }
        int ans = 0;
        while (!q.empty())
        {
            node tp = q.front();
            q.pop();
            cnt[tp.num]--;
            bool flag = true;
            for (int i = tp.num + 1; i <= 9; i++)
            {
                if (cnt[i] > 0)
                    flag = false; //只要后面有比它大的
            }
            if (flag)
            {
                ans++;
                if (tp.id == m)
                    break;
            }
            else
            {
                q.push(tp);
                cnt[tp.num]++;
            }
        }
        printf("%d\n", ans);
    }

    getchar();
    getchar();
    return 0;
}
